IGAA: An Efficient Optimization Technique for RFID Network Topology Design in Internet of Things

[[abstract]]Most RFID applications in the Internet of Things (IoTs) use multiple readers to read the IDs of multiple tags and form the RFID network. In such a network, unguarded reader deployment may generate over-crowded readers, cause interferences and, as a result, increases the deployment cost while degrading tag detection. Seeing that desirable reader deployment is crucial for RFID system performance, this paper introduces an optimization-based IGAA approach which outperforms existing RFID topology designs by turning up more favorable reader deployment and system performance. The new approach employs an advanced multi-objective fitness function and improved genetic annealing algorithms (GAA) to pursue a better RFID topology design. By involving an improved gene-stirring operation to help preserve good genes and locate optimal solutions for reader deployment, it is simple in operation but effective in practice. Experimental evaluation shows that when compared with related approaches, IGAA can yield better solution quality with less search time.[[notice]]補正完畢[[incitationindex]]EI[[booktype]]紙本[[booktype]]電子

An Efficient Video Content Delivery Strategy for Radio Access Network Environments

[[abstract]]When a radio access network (RAN) environment cannot handle the tremendous mobile data traffic, users may experience degraded or declined services. To help process the large number of user video requests in RANs, a content delivery network (CDN) architecture has been recently introduced, which establishes a number of cache servers outside the source server for users to get the needed data from the nearest cache server. To upgrade the performance of a wireless CDN, this paper presents a new caching strategy based on analytical results of real user video request traces and specific caching considerations for videos with different popularity degrees. The new strategy first caches videos with high popularity to all helpers and then caches those with low popularity to the remaining helper storage to enhance the overall request hits. Performance evaluation exhibits that, when compared with other caching strategies, our new strategy is able to yield better request hits with low complexity and average delay time.[[notice]]補正完畢[[incitationindex]]EI[[booktype]]紙本[[booktype]]電子

Effective Privacy Preservation in Third-Party Cloud Storage Auditing

[[notice]]補正完

Constructing Efficient Cache Invalidation Schemes in Mobile Environments

[[abstract]]Cache invalidation is an effective approach to maintaining data consistency between the server and mobile clients in a mobile environment. This paper presents two new cache invalidation schemes which are designed according to the real situations and are therefore able to comply with the more practical needs in a mobile environment. The ABI+HCQU divides data into different groups based on their utilization rates (hot/cold/query/update) and adapts their broadcasting intervals (ABI) accordingly to suit the actual needs. The SWRCC + MUVI (sleep/wakeup/recovery/check/confirm+modified/uncertain/ valid/ invalid) aims to solve the validity problem of cached data after a client is disconnected from the server. The new cache invalidation schemes are shown through experimental evaluation to outperform most existing schemes in terms of data access time, cache miss rates and bandwidth consumption.[[conferencetype]]國際[[conferencedate]]20071216~20071218[[iscallforpapers]]Y[[conferencelocation]]Shanghai, Chin

Efficient Topology Design in RFID Networks

[[abstract]]To pursue more desirable reader deployment for RFID networks, we present an efficient new topology design in this paper. We brief the new method NOP because it involves a non-optimization practice to avoid the tedious long heuristic search in existing optimization-based methods and meanwhile provides proper sequential considerations of objectives to avoid their improper objective utilization. As the collected simulation results demonstrate, our nonoptimization new method is able to generate better reader deployment with less complexity in contrast to existing optimization methods, or more specifically, we can turn over better fitness values at significantly shorter processing time.[[notice]]補正完

Efficient Route Discovery and Repair in Mobile Ad-hoc Networks

[[abstract]]Building proper routing protocols for a Mobile Ad-hoc Network (MANET) is a critical challenge because (1) flooding route requests often results in broadcast storm (especially when nodes or connections increase) and (2) re-broadcasting route discovery packets to rebuild or repair a broken path (caused by node mobility) will consume more control packets. To solve such broadcast storm and path damage problems, this paper mixes the ideas of multipoint relaying and 2-hop route repair into a new routing protocol suitable for large-scale MANETs. Simulation results show that the new protocol can effectively repair damaged routes at reduced bandwidth consumption.[[conferencetype]]國際[[conferencedate]]20120326~20120329[[iscallforpapers]]Y[[conferencelocation]]Fukuoka, Japa

A PKC-Based Node Revocation Scheme in Wireless Sensor Networks

[[abstract]]Generally deployed in an unattended environment, a sensor network can be easily assaulted or compromised by adversaries. Network security becomes a major problem. A distributed node revocation scheme is effective in reducing the damages a compromised node may cause to a sensor network, but its operation tends to consume large-scale memory space of the hardware-constrained sensor nodes. To reduce such complexity, this paper presents a new distributed voting revocation scheme based on the one-way hash chain, the concept of threshold secret sharing, the certificate revocation list and the public-key cryptography.[[conferencetype]]國際[[conferencedate]]20071206~20071208[[iscallforpapers]]Y[[conferencelocation]]Jeju, Kore

Efficient and Secure Cross-Realm Client-to-Client Password-Authenticated Key Exchange

[[conferencetype]]國際[[conferencedate]]20120326~20120329[[iscallforpapers]]Y[[conferencelocation]]Fukuoka, Japa

A New and Efficient Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks

[[abstract]]This paper presents a Bidirectional Hierarchy-based Any cast Routing (BHAR) protocol for collecting data over multi-hop wireless sensor networks (WSNs). The BHAR protocol improves on existing HAR mechanisms to speed up the process of constructing hierarchical trees and repairing routes, and as a result to prolong network lifetime. Different from HAR, BHAR allows sinks and sources to initialize the construction of a hierarchical tree. By knowing only its own parent and neighbor nodes, each node can join a tree, exchange/refresh its routing table, and perform route repair without geographical information or being controlled remotely. Simulation results show that our BHAR performs apparently better than traditional HAR on network construction and route repair.[[conferencetype]]國際[[conferencedate]]20100906~20100909[[iscallforpapers]]Y[[conferencelocation]]Taipei, Taiwa

Processor allocation in k-ary n-cube multiprocessors

[[abstract]]Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. We propose a new allocation strategy to utilize the large amount of processor resources in the k-ary n-cubes. Our strategy is an extension of the TC strategy on hypercubes and is able to recognize all subcubes with different topologies. Simulation results show that with such full subcube recognition ability and no internal fragmentation, our strategy depicts constantly better performance than other strategies, such as the Free list strategy on k-ary n-cubes and the Sniffing strategy[[sponsorship]]台灣大學[[conferencetype]]國際[[conferencedate]]19971218~19971220[[conferencelocation]]臺北市, 臺